SBL Mesh Filter: Fast Separable Approximation of Bilateral Mesh Filtering Additionnal Materials
نویسندگان
چکیده
Figure 2: Our approximation scheme provides similar results when compared to exact bilateral filtering while being several times faster. From top left to bottom right : a noisy mesh, bilateral filtering, Laplacian filtering, separable bilateral (SBL) filtering decomposed along unsmoothed curvature direction (SBL-u), SBL using random directions (SBL-r) and SBL using smoothed curvature directions (SBL-s). The error maps are given on a per-vertex basis using L norm. Figure 3: Filtering error. Histograms of the per-vertex error between the filtered meshes and the original one. It is very difficult to detect the difference between the two curves, wich demonstrates the good approximation of our method.
منابع مشابه
Discrete Regularization on Weighted Graphs for Image and Mesh Filtering
We propose a discrete regularization framework on weighted graphs of arbitrary topology, which unifies image and mesh filtering. The approach considers the problem as a variational one, which consists in minimizing a weighted sum of two energy terms: a regularization one that uses the discrete p-Laplace operator, and an approximation one. This formulation leads to a family of simple nonlinear f...
متن کاملStatic/Dynamic Filtering for Mesh Geometry
The joint bilateral filter, which enables feature-preserving signal smoothing according to the structural information from a guidance, has been applied for various tasks in geometry processing. Existing methods either rely on a static guidance that may be inconsistent with the input and lead to unsatisfactory results, or a dynamic guidance that is automatically updated but sensitive to noises a...
متن کاملRobust Higher-Order Filtering of Points
Processing noisy point data is a tedious task. It often requires smoothing and meshing, followed by mesh processing algorithms. In this work we present a robust filter which operates directly on points using higher order surface approximations, computed iteratively. We extend the bilateral filter by using and filtering surface curvature, and introducing a quality parameter based on our local su...
متن کاملRobust and High Fidelity Mesh Denoising
This paper presents a simple and effective two stage mesh denoising algorithm, where in the first stage, the face normal filtering is done by using the bilateral normal filtering in the robust statistics framework. Tukey’s bi-weight function is used as similarity function in the bilateral weighting, which is a robust estimator and stops the diffusion at sharp edges which helps to retain feature...
متن کاملFast Median Filtering Algorithms for Mesh Computers Fast Median Filtering Algorithms for Mesh Computers
Two fast algorithms for median ltering of images using parallel computers having 2-D mesh interconnections are given. Both algorithms assume that an n n image is loaded onto the mesh with one processing element per pixel. One algorithm performs median l-tering over d d neighborhoods in O(d 2) time and works with pixel values in an arbitrarily large range. This algorithm, while theoretically sub...
متن کامل